Timing-driven logic bi-decomposition
نویسندگان
چکیده
منابع مشابه
Timing-driven logic bi-decomposition
An approach for logic decomposition that produces circuits with reduced logic depth is presented. It combines two strategies: logic bi-decomposition of Boolean functions and tree-height reduction of Boolean expressions. It is a technology-independent approach that enables one to find tree-like expressions with smaller depths than the ones obtained by state-of-the-art techniques. The approach ca...
متن کاملLayout Driven Logic Restructuring/Decomposition
As feature sizes decrease and chip sizes increase, the area and performance of chips become dominated by the interconnect. In spite of this trend, most existing synthesis systems relegate the interconnect optimization to physical design. Physical design is, however, too far down in the design pipeline to meet the performance specifications by itself. Therefore, it is necessary for synthesis too...
متن کاملLayout-based Logic Decomposition for Timing Optimization
As feature sizes shrink to deep sub-micron, the performance of VLSI chips becomes dominated by the interconnect delay. In a traditional top-down design ow, logic synthesis algorithms optimize gate area or delay without accurate interconnect delay because of lack of physical design information. Thus, the e ectiveness of the optimization techniques is limited. We integrate logic synthesis and phy...
متن کاملTiming Driven Functional Decomposition for FPGAs
This work explores the effect of adding a timing driven functional decomposition step to the traditional field programmable gate array (FPGA) CAD flow. Once placement has completed, alternative decompositions of the logic on the critical path are examined for potential delay improvements. The placed circuit is then modified to use the best decompositions found. Any placement illegalities introd...
متن کاملBi-Decomposition and Tree-Height Reduction for Timing Optimization
A novel approach for timing-driven logic decomposition is presented. It is based on the combination of two strategies: logic bi-decomposition of Boolean functions and treeheight reduction of Boolean expressions. This technologyindependent approach allows to find tree-like expressions with smaller depths than the ones obtained by state-of-theart techniques. Experimental results show an average d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2003
ISSN: 0278-0070
DOI: 10.1109/tcad.2003.811447